A general construction of regular complete permutation polynomials

نویسندگان

چکیده

Let $$r\ge 3$$ be a positive integer and $${\mathbb {F}}_q$$ the finite field with q elements. In this paper, we consider r-regular complete permutation property of maps form $$f=\tau \circ \sigma _M\circ \tau ^{-1}$$ where $$\tau $$ is PP over an extension {F}}_{q^d}$$ $$\sigma _M$$ invertible linear map . When additive, give general construction CPPs for any r. not many examples regular fields $$r=3,4,5,6,7$$ arbitrary odd These are generalization first class constructed by Xu et al. (Des Codes Cryptogr 90:545–575, 2022).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A construction of loops by means of regular permutation sets

Following the slid product construction for loops with inverses of [6], we present here the general setting ensuring the construction of a new loop (L,⊕) starting from loops (K,+), (P, +̂) and (P,+) possessing suitable properties. The results established in the aforementioned note are generalized as well. Moreover we investigate the nuclei of L and the normality of subloops isomorphic to (K,+) a...

متن کامل

A general representation theory for constructing groups of permutation polynomials

Using the left regular action of a group on itself, we develop a general representation theory for constructing groups of permutation polynomials. As an application of the method, we compute polynomial representations of several abelian and nonabelian groups, and we determine the equivalence classes of the groups of polynomials we construct. In particular, when the size of the group is equal to...

متن کامل

More Classes of Complete Permutation Polynomials over $\F_q$

In this paper, by using a powerful criterion for permutation polynomials given by Zieve, we give several classes of complete permutation monomials over Fqr . In addition, we present a class of complete permutation multinomials, which is a generalization of recent work. Index Terms Finite field, Complete permutation polynomials, Walsh transform, Niho exponents.

متن کامل

Construction of regular languages and recognizability of polynomials

A generalization of numeration system in which N is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P ∈ Q[x] is a polynomial such that P (N) ⊂ N then we can construct a numeration system in which the set of representations of P (N) is regular. The main issue in this construction is to setup a regular langu...

متن کامل

Regular Sequences of Power Sums and Complete Symmetric Polynomials

In this article, we carry out the investigation for regular sequences of symmetric polynomials in the polynomial ring in three and four variable. Any two power sum element in C[x1,x2, . . . ,xn] for n ≥ 3 always form a regular sequence and we state the conjecture when pa, pb, pc for given positive integers a < b < c forms a regular sequence in C[x1,x2,x3,x4]. We also provide evidence for this c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2023

ISSN: ['0925-1022', '1573-7586']

DOI: https://doi.org/10.1007/s10623-023-01224-6